Rewriting and Well-Definedness within a Proof System
نویسندگان
چکیده
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with potentially ill-defined terms. In this paper, we provide a basis for integrating rewriting with a deductive proof system that deals with well-definedness. The definitions and theorems presented in this paper are the theoretical foundations for an extensible rewriting-based prover that has been implemented for the set theoretical formalism Event-B.
منابع مشابه
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a term rewriting system (TRS) in such a way that termination of the resulting TRS implies that the stream specification is well-defined, that is, admits a unique solution. As a consequence, proving well-d...
متن کاملMonotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomials whose coefficients (i.e., the parameters) are initially unknown and have to be instantiated suitably such that the resulting concrete polynomials satisfy certain conditions. We focus on monotonicity and well-defin...
متن کاملStringy Hodge Numbers and P-adic Hodge Theory
Stringy Hodge numbers are introduced by Batyrev for a mathematical formulation of mirror symmetry. However, since the stringy Hodge numbers of an algebraic variety are defined by choosing a resolution of singularities, the well-definedness is not clear from the definition. Batyrev proved the well-definedness by using the theory of motivic integration developed by Kontsevich, Denef-Loeser. The a...
متن کاملA Practical Approach to Partiality - A Proof Based Approach
Partial functions are frequently used when specifying and reasoning about computer programs. Using partial functions entails reasoning about potentially ill-defined expressions. In this paper we show how to formally reason about partial functions without abandoning the well understood domain of classical two-valued predicate calculus. In order to achieve this, we extend standard predicate calcu...
متن کاملConsidering Ill-Definedness of Problems from the Aspect of Solution Space
Most researchers agree that there is a continuum between well-definedness and ill-definedness. However, positioning a specific problem within this continuum is not always easy. To determine the degree of ill-definedness of a problem, in this paper, we propose a classification into the following five classes with respect to the size of the problems’s solution space: 1) one single solution, 2) on...
متن کامل